The Characteristic Polynomial of a Multiarrangement

نویسندگان

  • TAKURO ABE
  • HIROAKI TERAO
چکیده

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic polynomial of a multiarrangement which generalizes the characteristic polynomial of an arragnement. The characteristic polynomial of an arrangement is a combinatorial invariant, but this generalized characteristic polynomial is not. However, when the multiarrangement is free, we are able to prove the factorization theorem for the characteristic polynomial. The main result is a formula that relates ‘global’ data to ‘local’ data of a multiarrangement given by the coefficients of the respective characteristic polynomials. This result gives a new necessary condition for a multiarrangement to be free. Consequently it provides a simple method to show that a given multiarrangement is not free. 0. Introduction Let V be a vector space of dimension l over a field K and S = S(V ) be the symmetric algebra. We can choose coordinates for V ∗ such that S ∼= K[x1, . . . , xl]. Put ∂xi := ∂/∂xi. A hyperplane is a codimension one linear space in V . A multiarrangement is a finite collection of hyperplanes denoted by A together with a multiplicity function m : A → Z>0. Let (A,m) denote a multiarrangement. When m(H) = 1 for all H ∈ A, we identify (A,m) with the arrangement A. For p ≥ 1 the S-module Der(S) is the set of all alternating p-linear functions θ : S → S such that θ is a K-derivation in each variable. For p = 0 we put Der(S) = S. For each H ∈ A we choose a defining form αH . Put Q̃ = ∏ H∈A α m(H) H . Define the derivation modules of (A,m) as D(A,m) = {θ ∈ Der(S)|θ(αH , f2, . . . , fp) ∈ α m(H) H S for all H ∈ A and f2, . . . , fp ∈ S}. If D(A,m) is a free S-module we say that a multiarrangement (A,m) is free. One of the most fundamental invariants of an arrangement of hyperplanes is its characteristic polynomial. The focus of this paper is to generalize the characteristic polynomial to multiarrangements of hyperplanes and apply this polynomial to the problem of freeness of the module of derivations. In [17] Ziegler initiated the study Date: February 2, 2008. The first author is been supported by 21st Century COE Program “Mathematics of Nonlinear Structures via Singularities” Hokkaido University. The second author has been supported in part by Japan Society for the Promotion of Science. The third author has been supported by NSF grant # 0600893 and the NSF Japan program. 1 2 TAKURO ABE, HIROAKI TERAO, AND MAX WAKEFIELD of derivations of multiarrangements. Later in [14] and [15] Yoshinaga found that the derivation modules of multiarrangements are important for the study of free arrangements. It is known that any multiarrangement is free when l = 2 (see [12] and [17]). Other examples of free multiarrangements include the restricted multiarrangements of a free arrangement (see [17]) and the Coxeter arrangements with a constant multiplicity (see [11] and [13]). On the other hand, very few examples of non-free multiarrangements have been known. One purpose of this paper is to introduce a useful criterion for a multiarrangement to be non-free. In order to define the characteristic polynomial of a multiarrangement (A,m) we make use of the S-modules D(A,m). Since each D(A,m) is Z≥0-graded by polynomial degree, we may define a function ψ(A,m; t, q) = l

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

EFFECT OF LOCATION OF EXPLANATORY VARIABLE ON MONITORING POLYNOMIAL QUALITY PROFILES

The quality is typically modeled as the univariate or multivariate distribution of quality characteristic/s. In recent applications of statistical process control, quality profiles in which the relationship between a response and explanatory variable/s is captured and monitored are increasingly used to model the quality. Several techniques have been developed to enhance the speed of detecting c...

متن کامل

The Laplacian Polynomial and Kirchhoff Index of the k-th‎ Semi Total Point Graphs

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006